翻訳と辞書 |
Chinese monoid : ウィキペディア英語版 | Chinese monoid In mathematics, the Chinese monoid is a monoid generated by a totally ordered alphabet with the relations ''cba'' = ''cab'' = ''bca'' for every ''a'' ≤ ''b'' ≤ ''c''. An algorithm similar to Schensted's algorithm yields characterisation of the equivalence classes and a cross-section theorem. It was discovered by during their classification of monoids with growth similar to that of the plactic monoid, and studied in detail by Julien Cassaigne, Marc Espie, Daniel Krob, Jean-Christophe Novelli, and Florent Hivert in 2001. The Chinese monoid has a regular language cross-section : and hence polynomial growth of dimension . ==References==
*
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Chinese monoid」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|